Coding Challenge of the Week: "Turing's Tangled Toes"
This week, our challenge is to write a function that untangles the toes of a fictional AI named Turing, who has developed a rather... unique... gait.
Here's the problem in more detail:
Challenge Spec
Turing's Toes are a mess! Given a list of toe lengths and their respective connections, write a function that calculates the minimum number of moves required to untangle Turing's Toes.
Input: A list of arrays, where each array represents a toe's connections to its neighbors. Each element in the array is the index of the neighboring toe.
Output: The minimum number of moves required to untangle Turing's Toes.
Example:
[1, 2, 3, 4, 5, 6, 7, 8]
Example Output:
3
Challenge your coding skills and help us untangle Turing's Toes!
Learn more about Turing's Toes and the challenge.